Time and Space Efficient Implementation of Robust Biclustering Algorithm (ROBA)

A biclustering algorithm named Robust Biclustering Algorithm (ROBA) [2] has been used in a number of recent research works. The existing implementation of ROBA is not that time and space efficient. In this work, we develop a time and space efficient implementation of ROBA. We elicit some subtle properties of the base principle of ROBA to achieve these efficiencies. We reduce both time and space requirements by a factor of L where L is the number of distinct values present in the N x M input data matrix. The comparison of time and space requirement between the existing implementation and our implementation is summarized in table 1.